package algorithm.stackAndQueue;


/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * boolean param_4 = obj.empty();
 */
//class MyQueue {
//
//    /** 添加元素到队尾 */
//    public void push(int x);
//
//    /** 删除队头的元素并返回 */
//    public int pop();
//
//    /** 返回队头元素 */
//    public int peek();
//
//    /** 判断队列是否为空 */
//    public boolean empty();
//}


